Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
نویسندگان
چکیده
منابع مشابه
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
We consider the fault-tolerant capabilities of networks of processors whose underlying topology is that of the k-ary n-cube Qn, where k ≥ 3 and n ≥ 2. In particular, given a copy of Qn where some of the interprocessor links may be faulty but where every processor is incident with at least two healthy links, we show that if the number of faults is at most 4n− 5, then Qn still contains a Hamilton...
متن کاملEmbeddings of hamiltonian paths in faulty k-ary 2-cubes
It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y ) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y , there exists a hamiltonian path from u to v in the faulty k-ar...
متن کاملHamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...
متن کاملAn Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes
The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...
متن کاملAugmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2002
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480196311183